Partitioning the multiagent simple temporal problem for concurrency and privacy
نویسندگان
چکیده
منابع مشابه
A Comparison of Algorithms for Solving the Multiagent Simple Temporal Problem
The Simple Temporal Problem (STP) is a popular representation for solving centralized scheduling and planning problems. When scheduling agents are associated with different users who need to coordinate some of their activities, however, considerations such as privacy and scalability suggest solving the joint STP in a more distributed manner. Building on recent advances in STP algorithms that ex...
متن کاملMultiagent Simple Temporal Problem: The Arc-Consistency Approach
The Simple Temporal Problem (STP) is a fundamental temporal reasoning problem and has recently been extended to the Multiagent Simple Temporal Problem (MaSTP). In this paper we present a novel approach that is based on enforcing arc-consistency (AC) on the input (multiagent) simple temporal network. We show that the AC-based approach is sufficient for solving both the STP and MaSTP and provide ...
متن کاملPrivacy Spatial and Temporal Distances in Nomadic Settelments
Human always in interaction with their social environment, have consider some degree of privacy with different purposes, for themselves, the people around them and carry out their activities. Creating privacy depends on two elements; subjective meanings that ruling the creation of privacy, and the second sentence are person available facilities. Privacy is not seen, heard, smelled and availabil...
متن کاملA Multiagent Reinforcement Learning algorithm to solve the Community Detection Problem
Community detection is a challenging optimization problem that consists of searching for communities that belong to a network under the assumption that the nodes of the same community share properties that enable the detection of new characteristics or functional relationships in the network. Although there are many algorithms developed for community detection, most of them are unsuitable when ...
متن کاملDistributed Decoupling of Multiagent Simple Temporal Problems
We propose a new distributed algorithm for decoupling the Multiagent Simple Temporal Network (MaSTN) problem. The agents cooperatively decouple the MaSTN while simultaneously optimizing a sum of concave objectives local to each agent. Several schedule flexibility measures are applicable in this framework. We pose the MaSTN decoupling problem as a distributed convex optimization problem subject ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010